________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:14:04
Input Data from:  dataset105.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,073
Average f[i]   :4200
Average g[i,j] :1918,75
Total demand   :5560
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	4000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	110	1	-1	3	8500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0    >new incumb.: 110


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	260	1	-1	4	14000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0    >new incumb.: 260


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 39
> Selected Move:	700	1	-1	5	19500


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0    >new incumb.: 700


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 27
> Selected Move:	860	3	3	9	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1    >new incumb.: 860


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 27
> Selected Move:	750	2	2	-1	16000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 34
> Selected Move:	860	3	9	7	17500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	800	3	7	8	17500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 31
> Selected Move:	780	3	0	7	19400


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 15
> Selected Move:	780	4	7	4	20000


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 14
> Selected Move:	780	4	4	8	19300


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 17
> Selected Move:	732	4	8	5	20100


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 14
> Selected Move:	780	3	5	0	18500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 28
> Selected Move:	780	3	1	5	20000


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 21
> Selected Move:	780	4	5	7	19100


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 22
> Selected Move:	780	4	7	8	19600


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 25
> Selected Move:	730	3	8	9	19400


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 25
> Selected Move:	730	4	9	4	19300


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 26
> Selected Move:	730	4	4	5	18500


> New Y[]: 
	
	 2  0  0  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 26
> Selected Move:	730	4	5	7	17600


> New Y[]: 
	
	 2  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 28
> Selected Move:	570	3	9	3	17100


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 27
> Selected Move:	590	3	7	1	15500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 32
> Selected Move:	710	1	-1	6	20000


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 32
> Selected Move:	693	3	6	9	20500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 25
> Selected Move:	665	3	3	6	20500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 29
> Selected Move:	650	3	9	2	19500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 33
> Selected Move:	560	2	2	-1	15500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 33
> Selected Move:	550	3	6	2	15000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 31
> Selected Move:	530	3	0	7	16900


> New Y[]: 
	
	 0  3  1  0  1  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 11
> Selected Move:	730	3	2	9	17900


> New Y[]: 
	
	 0  3  0  0  1  1  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 20
> Selected Move:	730	4	7	4	18500


> New Y[]: 
	
	 0  3  0  0  2  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 18
> Selected Move:	730	4	4	5	18600


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 17
> Selected Move:	730	4	5	9	19900


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 22
> Selected Move:	570	3	9	3	19100


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 22
> Selected Move:	570	4	3	4	18000


> New Y[]: 
	
	 0  3  0  1  2  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 23
> Selected Move:	570	4	4	5	18100


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 22
> Selected Move:	570	4	5	7	17400


> New Y[]: 
	
	 0  3  0  1  1  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 23
> Selected Move:	540	3	3	6	17400


> New Y[]: 
	
	 0  3  0  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 29
> Selected Move:	540	4	7	4	18000


> New Y[]: 
	
	 0  3  0  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 26
> Selected Move:	540	4	4	5	18100


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 24
> Selected Move:	540	4	5	6	19000


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 24
> Selected Move:	530	3	6	2	19800


> New Y[]: 
	
	 0  3  2  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 17
> Selected Move:	530	4	2	4	17500


> New Y[]: 
	
	 0  3  1  0  2  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 23
> Selected Move:	530	4	4	5	17600


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 22
> Selected Move:	530	3	5	0	16000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 34
> Selected Move:	730	3	2	9	17000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 34
> Selected Move:	730	3	4	5	17000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 31
> Selected Move:	780	3	9	8	18500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 35
> Selected Move:	570	3	8	3	16500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 35
> Selected Move:	570	3	1	4	18800


> New Y[]: 
	
	 2  0  0  1  3  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 22
> Selected Move:	570	4	4	3	19800


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 20
> Selected Move:	570	4	3	5	18000


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 24
> Selected Move:	570	3	5	1	16500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 31
> Selected Move:	548	1	-1	2	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 32
> Selected Move:	580	3	3	5	21500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 18
> Selected Move:	585	3	4	9	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 32
> Selected Move:	590	3	5	4	21000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 29
> Selected Move:	570	3	4	3	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 34
> Selected Move:	570	3	7	4	19000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 31
> Selected Move:	580	3	2	6	19500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 35
> Selected Move:	580	3	4	5	19500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 37
> Selected Move:	570	3	6	2	19000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 32
> Selected Move:	570	3	9	7	20500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 63 #######################


> Neighbours evaluated; 29
> Selected Move:	560	3	2	4	22000


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 64 #######################


> Neighbours evaluated; 18
> Selected Move:	595	3	3	9	22500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 65 #######################


> Neighbours evaluated; 19
> Selected Move:	528	3	4	3	21500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 66 #######################


> Neighbours evaluated; 22
> Selected Move:	520	3	5	4	21500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 67 #######################


> Neighbours evaluated; 20
> Selected Move:	483	3	3	6	21500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 26
> Selected Move:	540	2	9	-1	16500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 69 #######################


> Neighbours evaluated; 32
> Selected Move:	540	3	1	5	18000


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 29
> Selected Move:	540	4	5	4	18800


> New Y[]: 
	
	 2  0  0  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,265

## ITERATION 71 #######################


> Neighbours evaluated; 27
> Selected Move:	568	3	6	8	20800


> New Y[]: 
	
	 2  0  0  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,27

## ITERATION 72 #######################


> Neighbours evaluated; 20
> Selected Move:	530	3	8	2	18300


> New Y[]: 
	
	 2  0  1  0  3  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,275

## ITERATION 73 #######################


> Neighbours evaluated; 22
> Selected Move:	530	4	4	2	19600


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,28

## ITERATION 74 #######################


> Neighbours evaluated; 20
> Selected Move:	540	3	2	6	19800


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,275

## ITERATION 75 #######################


> Neighbours evaluated; 20
> Selected Move:	540	4	6	7	17100


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,27

## ITERATION 76 #######################


> Neighbours evaluated; 28
> Selected Move:	530	3	6	2	16600


> New Y[]: 
	
	 2  0  1  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,265

## ITERATION 77 #######################


> Neighbours evaluated; 24
> Selected Move:	530	4	7	5	17500


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,26

## ITERATION 78 #######################


> Neighbours evaluated; 24
> Selected Move:	450	3	0	8	19300


> New Y[]: 
	
	 0  0  1  0  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,255

## ITERATION 79 #######################


> Neighbours evaluated; 20
> Selected Move:	510	3	2	3	19800


> New Y[]: 
	
	 0  0  0  1  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,25

## ITERATION 80 #######################


> Neighbours evaluated; 16
> Selected Move:	510	4	5	7	18900


> New Y[]: 
	
	 0  0  0  1  1  1  0  3  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,245

## ITERATION 81 #######################


> Neighbours evaluated; 19
> Selected Move:	510	4	7	8	19500


> New Y[]: 
	
	 0  0  0  1  1  1  0  2  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,24

## ITERATION 82 #######################


> Neighbours evaluated; 17
> Selected Move:	510	4	8	5	19900


> New Y[]: 
	
	 0  0  0  1  1  3  0  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,235

## ITERATION 83 #######################


> Neighbours evaluated; 16
> Selected Move:	510	4	5	7	19700


> New Y[]: 
	
	 0  0  0  1  1  2  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,23

## ITERATION 84 #######################


> Neighbours evaluated; 15
> Selected Move:	510	4	5	4	19600


> New Y[]: 
	
	 0  0  0  1  2  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,225

## ITERATION 85 #######################


> Neighbours evaluated; 19
> Selected Move:	510	3	4	0	18100


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,22

## ITERATION 86 #######################


> Neighbours evaluated; 29
> Selected Move:	510	4	7	5	19000


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,215

## ITERATION 87 #######################


> Neighbours evaluated; 24
> Selected Move:	510	4	5	8	18600


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,21

## ITERATION 88 #######################


> Neighbours evaluated; 24
> Selected Move:	510	3	5	4	18600


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,205

## ITERATION 89 #######################


> Neighbours evaluated; 25
> Selected Move:	510	4	8	4	19800


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,2

## ITERATION 90 #######################


> Neighbours evaluated; 21
> Selected Move:	510	4	4	7	18100


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,195

## ITERATION 91 #######################


> Neighbours evaluated; 26
> Selected Move:	510	3	7	1	16500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 92 #######################


> Neighbours evaluated; 34
> Selected Move:	570	1	-1	5	22000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 93 #######################


> Neighbours evaluated; 28
> Selected Move:	613	3	3	2	21500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 94 #######################


> Neighbours evaluated; 30
> Selected Move:	540	3	2	6	22000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 95 #######################


> Neighbours evaluated; 33
> Selected Move:	630	3	8	7	22000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 96 #######################


> Neighbours evaluated; 22
> Selected Move:	595	3	4	9	21500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 97 #######################


> Neighbours evaluated; 32
> Selected Move:	543	3	9	2	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 98 #######################


> Neighbours evaluated; 35
> Selected Move:	540	3	5	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 99 #######################


> Neighbours evaluated; 32
> Selected Move:	520	3	4	9	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,19

## ITERATION 100 #######################


> Neighbours evaluated; 33
> Selected Move:	520	3	7	4	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 101 #######################


> Neighbours evaluated; 32
> Selected Move:	520	3	4	5	19000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 102 #######################


> Neighbours evaluated; 31
> Selected Move:	520	3	5	8	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 103 #######################


> Neighbours evaluated; 37
> Selected Move:	540	3	6	3	20000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 104 #######################


> Neighbours evaluated; 34
> Selected Move:	495	3	9	4	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 105 #######################


> Neighbours evaluated; 29
> Selected Move:	493	3	4	5	20500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,22

## ITERATION 106 #######################


> Neighbours evaluated; 30
> Selected Move:	510	2	2	-1	16500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 107 #######################


> Neighbours evaluated; 32
> Selected Move:	510	3	0	4	18000


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,21

## ITERATION 108 #######################


> Neighbours evaluated; 26
> Selected Move:	510	4	4	3	19100


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,205

## ITERATION 109 #######################


> Neighbours evaluated; 21
> Selected Move:	510	4	3	5	18100


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,2

## ITERATION 110 #######################


> Neighbours evaluated; 23
> Selected Move:	510	4	5	8	17300


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,195

## ITERATION 111 #######################


> Neighbours evaluated; 25
> Selected Move:	510	3	4	7	18300


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,19

## ITERATION 112 #######################


> Neighbours evaluated; 25
> Selected Move:	510	4	8	5	19100


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,185

## ITERATION 113 #######################


> Neighbours evaluated; 22
> Selected Move:	510	4	5	7	18400


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,18

## ITERATION 114 #######################


> Neighbours evaluated; 23
> Selected Move:	510	3	5	4	18400


> New Y[]: 
	
	 0  3  0  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,175

## ITERATION 115 #######################


> Neighbours evaluated; 24
> Selected Move:	510	4	7	4	19000


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,17

## ITERATION 116 #######################


> Neighbours evaluated; 22
> Selected Move:	510	4	4	8	18300


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,165

## ITERATION 117 #######################


> Neighbours evaluated; 22
> Selected Move:	494	4	8	3	20100


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,16

## ITERATION 118 #######################


> Neighbours evaluated; 20
> Selected Move:	494	3	4	5	20100


> New Y[]: 
	
	 0  3  0  2  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,155

## ITERATION 119 #######################


> Neighbours evaluated; 22
> Selected Move:	460	3	3	6	20000


> New Y[]: 
	
	 0  3  0  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,15

## ITERATION 120 #######################


> Neighbours evaluated; 28
> Selected Move:	460	4	6	5	19100


> New Y[]: 
	
	 0  3  0  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,145

## ITERATION 121 #######################


> Neighbours evaluated; 29
> Selected Move:	460	4	5	7	18400


> New Y[]: 
	
	 0  3  0  0  0  1  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,14

## ITERATION 122 #######################


> Neighbours evaluated; 30
> Selected Move:	460	4	7	8	18300


> New Y[]: 
	
	 0  3  0  0  0  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,135

## ITERATION 123 #######################


> Neighbours evaluated; 29
> Selected Move:	540	3	8	0	16500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 124 #######################


> Neighbours evaluated; 28
> Selected Move:	560	1	-1	3	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 125 #######################


> Neighbours evaluated; 31
> Selected Move:	565	3	5	4	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 126 #######################


> Neighbours evaluated; 30
> Selected Move:	570	3	6	8	23000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,125

## ITERATION 127 #######################


> Neighbours evaluated; 23
> Selected Move:	720	3	3	5	24000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 128 #######################


> Neighbours evaluated; 21
> Selected Move:	565	3	7	9	22500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 129 #######################


> Neighbours evaluated; 31
> Selected Move:	450	4	0	4	18500


> New Y[]: 
	
	 0  3  0  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,14

## ITERATION 130 #######################


> Neighbours evaluated; 32
> Selected Move:	460	3	8	3	16500


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,145

## ITERATION 131 #######################


> Neighbours evaluated; 28
> Selected Move:	498	1	-1	2	20500


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,15

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	480	4	4	5	20600


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,155

## ITERATION 133 #######################


> Neighbours evaluated; 26
> Selected Move:	460	2	2	-1	16600


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,16

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	460	4	5	3	17600


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,165

## ITERATION 135 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	3	9	17900


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,17

## ITERATION 136 #######################


> Neighbours evaluated; 24
> Selected Move:	460	3	1	7	19500


> New Y[]: 
	
	 0  0  0  1  1  1  0  3  0  2 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,165

## ITERATION 137 #######################


> Neighbours evaluated; 19
> Selected Move:	460	4	7	9	19300


> New Y[]: 
	
	 0  0  0  1  1  1  0  2  0  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,16

## ITERATION 138 #######################


> Neighbours evaluated; 19
> Selected Move:	460	4	7	4	19900


> New Y[]: 
	
	 0  0  0  1  2  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,155

## ITERATION 139 #######################


> Neighbours evaluated; 17
> Selected Move:	495	3	9	8	20100


> New Y[]: 
	
	 0  0  0  1  2  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,15

## ITERATION 140 #######################


> Neighbours evaluated; 16
> Selected Move:	480	4	4	5	20200


> New Y[]: 
	
	 0  0  0  1  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,145

## ITERATION 141 #######################


> Neighbours evaluated; 13
> Selected Move:	460	3	8	9	20000


> New Y[]: 
	
	 0  0  0  1  1  2  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,14

## ITERATION 142 #######################


> Neighbours evaluated; 19
> Selected Move:	460	4	9	4	19900


> New Y[]: 
	
	 0  0  0  1  3  2  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,135

## ITERATION 143 #######################


> Neighbours evaluated; 20
> Selected Move:	460	4	4	5	19000


> New Y[]: 
	
	 0  0  0  1  2  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,13

## ITERATION 144 #######################


> Neighbours evaluated; 20
> Selected Move:	460	4	4	7	18400


> New Y[]: 
	
	 0  0  0  1  1  3  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,125

## ITERATION 145 #######################


> Neighbours evaluated; 21
> Selected Move:	460	4	5	4	19200


> New Y[]: 
	
	 0  0  0  1  3  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,12

## ITERATION 146 #######################


> Neighbours evaluated; 19
> Selected Move:	460	4	4	7	18100


> New Y[]: 
	
	 0  0  0  1  2  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,115

## ITERATION 147 #######################


> Neighbours evaluated; 17
> Selected Move:	460	4	4	3	19200


> New Y[]: 
	
	 0  0  0  2  1  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,11

## ITERATION 148 #######################


> Neighbours evaluated; 20
> Selected Move:	460	4	3	5	18200


> New Y[]: 
	
	 0  0  0  1  1  2  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,105

## ITERATION 149 #######################


> Neighbours evaluated; 16
> Selected Move:	460	3	5	0	16600


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,0999999999999996

## ITERATION 150 #######################


> Neighbours evaluated; 28
> Selected Move:	670	1	-1	5	22100


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 151 #######################


> Neighbours evaluated; 26
> Selected Move:	688	3	3	2	21600


> New Y[]: 
	
	 2  0  1  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 30
> Selected Move:	661	3	2	6	22100


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 30
> Selected Move:	595	4	7	5	23000


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 31
> Selected Move:	640	3	6	2	22500


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 29
> Selected Move:	625	3	2	3	23000


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 26
> Selected Move:	538	4	5	4	23800


> New Y[]: 
	
	 2  0  0  1  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 27
> Selected Move:	527	3	3	2	23300


> New Y[]: 
	
	 2  0  1  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 28
> Selected Move:	500	4	4	9	23400


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,105

## ITERATION 159 #######################


> Neighbours evaluated; 29
> Selected Move:	492	3	9	8	23600


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,11

## ITERATION 160 #######################


> Neighbours evaluated; 29
> Selected Move:	529	4	8	7	23100


> New Y[]: 
	
	 2  0  1  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,115

## ITERATION 161 #######################


> Neighbours evaluated; 28
> Selected Move:	554	3	8	3	21100


> New Y[]: 
	
	 2  0  1  1  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,12

## ITERATION 162 #######################


> Neighbours evaluated; 23
> Selected Move:	498	3	2	6	21600


> New Y[]: 
	
	 2  0  0  1  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,125

## ITERATION 163 #######################


> Neighbours evaluated; 28
> Selected Move:	493	3	3	2	21100


> New Y[]: 
	
	 2  0  1  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,13

## ITERATION 164 #######################


> Neighbours evaluated; 26
> Selected Move:	442	3	4	9	20600


> New Y[]: 
	
	 2  0  1  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,135

## ITERATION 165 #######################


> Neighbours evaluated; 30
> Selected Move:	489	3	6	3	20600


> New Y[]: 
	
	 2  0  1  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,14

## ITERATION 166 #######################


> Neighbours evaluated; 26
> Selected Move:	486	3	5	4	20600


> New Y[]: 
	
	 2  0  1  1  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,145

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	498	3	7	5	20500


> New Y[]: 
	
	 2  0  1  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,15

## ITERATION 168 #######################


> Neighbours evaluated; 24
> Selected Move:	460	2	2	-1	16500


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,155

## ITERATION 169 #######################


> Neighbours evaluated; 26
> Selected Move:	510	3	9	8	18000


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,16

## ITERATION 170 #######################


> Neighbours evaluated; 25
> Selected Move:	510	4	5	3	19800


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,165

## ITERATION 171 #######################


> Neighbours evaluated; 23
> Selected Move:	510	4	3	4	18800


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 22
> Selected Move:	510	4	4	8	17600


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 24
> Selected Move:	460	3	3	6	17600


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,17

## ITERATION 174 #######################


> Neighbours evaluated; 31
> Selected Move:	460	4	8	4	18800


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,165

## ITERATION 175 #######################


> Neighbours evaluated; 30
> Selected Move:	460	4	4	5	18000


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,16

## ITERATION 176 #######################


> Neighbours evaluated; 30
> Selected Move:	460	4	5	6	19800


> New Y[]: 
	
	 2  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,155

## ITERATION 177 #######################


> Neighbours evaluated; 28
> Selected Move:	450	3	6	2	19600


> New Y[]: 
	
	 2  0  3  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,15

## ITERATION 178 #######################


> Neighbours evaluated; 22
> Selected Move:	450	4	2	4	18300


> New Y[]: 
	
	 2  0  1  0  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,145

## ITERATION 179 #######################


> Neighbours evaluated; 26
> Selected Move:	450	4	4	5	17500


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,14

## ITERATION 180 #######################


> Neighbours evaluated; 26
> Selected Move:	450	4	5	8	17100


> New Y[]: 
	
	 2  0  1  0  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,135

## ITERATION 181 #######################


> Neighbours evaluated; 24
> Selected Move:	450	3	0	7	19000


> New Y[]: 
	
	 0  0  1  0  1  1  0  2  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,13

## ITERATION 182 #######################


> Neighbours evaluated; 20
> Selected Move:	460	3	2	6	19500


> New Y[]: 
	
	 0  0  0  0  1  1  1  2  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,125

## ITERATION 183 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	7	8	18900


> New Y[]: 
	
	 0  0  0  0  1  1  1  3  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,12

## ITERATION 184 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	7	5	19800


> New Y[]: 
	
	 0  0  0  0  1  3  1  1  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,115

## ITERATION 185 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	8	7	19900


> New Y[]: 
	
	 0  0  0  0  1  3  1  2  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,11

## ITERATION 186 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	5	7	19700


> New Y[]: 
	
	 0  0  0  0  1  2  1  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,105

## ITERATION 187 #######################


> Neighbours evaluated; 26
> Selected Move:	460	4	5	4	19600


> New Y[]: 
	
	 0  0  0  0  2  1  1  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,0999999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 26
> Selected Move:	460	3	4	0	18100


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,0949999999999996

## ITERATION 189 #######################


> Neighbours evaluated; 30
> Selected Move:	538	1	-1	4	23600


> New Y[]: 
	
	 2  0  0  0  1  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 190 #######################


> Neighbours evaluated; 24
> Selected Move:	606	3	6	3	23600


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	582	4	7	8	24100


> New Y[]: 
	
	 2  0  0  1  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 192 #######################


> Neighbours evaluated; 23
> Selected Move:	570	4	8	5	24500


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 193 #######################


> Neighbours evaluated; 24
> Selected Move:	570	3	3	2	24000


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 25
> Selected Move:	670	3	5	1	22500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 30
> Selected Move:	658	3	4	5	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 32
> Selected Move:	660	3	2	3	23000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 21
> Selected Move:	595	3	3	6	23000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 26
> Selected Move:	580	3	5	4	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,105

## ITERATION 199 #######################


> Neighbours evaluated; 30
> Selected Move:	505	3	7	3	21000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,11

## ITERATION 200 #######################


> Neighbours evaluated; 32
> Selected Move:	500	3	4	5	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 201 #######################


> Neighbours evaluated; 31
> Selected Move:	493	3	3	2	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 202 #######################


> Neighbours evaluated; 31
> Selected Move:	490	3	5	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,125

## ITERATION 203 #######################


> Neighbours evaluated; 30
> Selected Move:	460	2	2	-1	16500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,13

## ITERATION 204 #######################


> Neighbours evaluated; 30
> Selected Move:	460	3	0	5	18100


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,135
________________________________________________________________

Best solution found: 860
Run Termination time: 03.02.2010 20:14:33
Run duration: 00:00:29.1250000
________________________________________________________________
